A Boundary Property for Upper Domination
نویسندگان
چکیده
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4-free graphs or 2K2-free graphs. For classes defined by finitely many forbidden induced subgraphs, the boundary separating difficult instances of the problem from polynomially solvable ones consists of the so called boundary classes. However, none of such classes has been identified so far for the upper dominating set problem. In the present paper, we discover the first boundary class for this problem.
منابع مشابه
Hypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملDomination with respect to nondegenerate properties: bondage number
For a graphical property P and a graph G, a subset S of vertices of G is a P-set if the subgraph induced by S has the property P . The domination number with respect to the property P , denoted by γP(G), is the minimum cardinality of a dominating P-set. The bondage number with respect to the property P of a nonempty graph G, denoted bP(G), is the cardinality of a smallest set of edges whose rem...
متن کاملOn Equality in an Upper Bound for the Domination Number with Respect to Nondegenerate Properties
For a graph property P and a graph G , a subset S of vertices of G is a P -set if the subgraph induced by S has the property P . The domination number with respect to the property P , denoted by γP(G) , is the minimum cardinality of a dominating P -set. Any property P satisfied by all edgeless graphs is called nondegenerate. For any graph G with n vertices and maximum degree ∆(G) , γP(G) ≤ n−∆(...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملDouble Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
متن کامل